منابع مشابه
On a general class of inhomogeneous random digraphs
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models includes as special cases the directed versions of the Erdős-Rényi model, graphs with given expected degrees, the generalized random graph, and the Poissonian ...
متن کاملPageRank and random walks on graphs
We examine the relationship between PageRank and several invariants occurring in the study of random walks and electrical networks. We consider a generalized version of hitting time and effective resistance with an additional parameter which controls the ‘speed’ of diffusion. We will establish their connection with PageRank . Through these connections, a combinatorial interpretation of PageRank...
متن کاملRandom Alpha PageRank
We suggest a revision to the PageRank random surfer model that considers the influence of a population of random surfers on the PageRank vector. In the revised model, each member of the population has its own teleportation parameter chosen from a probability distribution, and consequently, the ranking vector is random. We propose three algorithms for computing the statistics of the random ranki...
متن کاملRandom Walks on Ramanujan Complexes and Digraphs
The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a simple group G over a local field F . We show that if T is any k-regular G-equivariant operator on the Bruhat–Tits building with a simple combinatorial property ...
متن کاملPageRank in Undirected Random Graphs
PageRank has numerous applications in information retrieval, reputation systems, machine learning, and graph partitioning. In this paper, we study PageRank in undirected random graphs with an expansion property. The Chung-Lu random graph is an example of such a graph. We show that in the limit, as the size of the graph goes to infinity, PageRank can be approximated by a mixture of the restart d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2020
ISSN: 0304-4149
DOI: 10.1016/j.spa.2019.07.002